Augmented GMRES-type methods
نویسندگان
چکیده
GMRES is a popular iterative method for the solution of large linear systems of equations with a square nonsymmetric matrix. The method generates a Krylov subspace in which an approximate solution is determined. We present modifications of the GMRES and the closely related RRGMRES methods that allow augmentation of the Krylov subspaces generated by these methods by a user-supplied subspace. We choose this subspace to enable the representation of certain known nonsmooth features of the desired solution, such as jumps, or to make it possible to represent certain smooth functions, such as constants or linear functions. The latter choice of augmenting subspace appears to be new. Applications to the solution of both well-posed and ill-posed problems are presented. Copyright c © 2006 John Wiley & Sons, Ltd.
منابع مشابه
Restarted GMRES method Augmented with the Combination of Harmonic Ritz Vectors and Error Approximations
Restarted GMRES methods augmented with approximate eigenvectors are widely used for solving large sparse linear systems. Recently a new scheme of augmenting with error approximations is proposed. The main aim of this paper is to develop a restarted GMRES method augmented with the combination of harmonic Ritz vectors and error approximations. We demonstrate that the resulted combination method c...
متن کاملSome Remarks on the Restarted and Augmented Gmres Method
Starting from the residual estimates for GMRES formulated by many authors, usually in terms of the quotient of the Hermitian part and the norm of a matrix or by using the field of values of a matrix, we present more general estimates which hold also for restarted and augmented GMRES. Sufficient conditions for convergence are formulated. All estimates are independent on the choice of an initial ...
متن کاملGGMRES: A GMRES--type algorithm for solving singular linear equations with index one
In this paper, an algorithm based on the Drazin generalized conjugate residual (DGMRES) algorithm is proposed for computing the group-inverse solution of singular linear equations with index one. Numerical experiments show that the resulting group-inverse solution is reasonably accurate and its computation time is significantly less than that of group-inverse solution obtained by the DGMRES alg...
متن کاملA Restarted Gmres Method Augmented with Eigenvectors * Ronald
The GMRES method for solving nonsymmetric linear equations is generally used with restarting to reduce storage and orthogonalization costs. Restarting slows down the convergence. However, it is possible to save some important information at the time of the restart. It is proposed that approximate eigenvectors corresponding to a few of the smallest eigenvalues be formed and added to the subspace...
متن کاملOn the numerical solution of generalized Sylvester matrix equations
The global FOM and GMRES algorithms are among the effective methods to solve Sylvester matrix equations. In this paper, we study these algorithms in the case that the coefficient matrices are real symmetric (real symmetric positive definite) and extract two CG-type algorithms for solving generalized Sylvester matrix equations. The proposed methods are iterative projection metho...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Numerical Lin. Alg. with Applic.
دوره 14 شماره
صفحات -
تاریخ انتشار 2007